Algorithmic Methods for Ph / Ph / 1 Queues with Batch Arrivals or Services
نویسنده
چکیده
We discuss algorithms for the computation of the steady state features of PH/PH/l queues with bounded batch arrivals or batch services. Many characteristic quantities such as the mean and variance of queue length in continuous time, the mean waiting time, the waiting probability, etc. are obtained in computationaJIy tractable forms. We also show various numerical values.
منابع مشابه
Analysis of a finite MAP/G/1 queue with group services
The finite capacity queues, G I / P H / 1 / N and PH/G/1 /N, in which customers are served in groups of varying sizes were recently introduced and studied in detail by the author. In this paper we consider a finite capacity queue in which arrivals are governed by a particular Markov renewal process, called a Markovian arrival process (MAP). With general service times and with the same type of s...
متن کاملBatch queues, reversibility and first-passage percolation
We consider a model of queues in discrete time, with batch services and arrivals. The case where arrival and service batches both have Bernoulli distributions corresponds to a discrete-time M/M/1 queue, and the case where both have geometric distributions has also been previously studied. We describe a common extension to a more general class where the batches are the product of a Bernoulli and...
متن کاملAsymptotics for Steady-state Tail Probabilities in Structured Markov Queueing Models
In this paper we establish asymptotics for the basic steady-state distributions in a large class of single-server queues. We consider the waiting time, the workload (virtual waiting time) and the steady-state queue lengths at an arbitrary time, just before an arrival and just after a departure. We start by establishing asymptotics for steady-state distributions of Markov chains of M/GI/1 type. ...
متن کاملAnalysis of the adaptive MMAP[K]/PH[K]/1 queue: A multi-type queue with adaptive arrivals and general impatience
In this paper we introduce the adaptive MMAP[K] arrival process and analyze the adaptive MMAP[K]/PH[K]/1 queue. In such a queueing system, customers of K different types with Markovian inter-arrival times and possibly correlated customer types, are fed to a single server queue that makes use of r thresholds. Service times are phase-type and depend on the type of customer in service. Type k cust...
متن کاملTitle: THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALS
We consider M/G/1-type Markov chains where a transition that decreases the value of the level triggers the phase to a small subset of the phase space. We show how this structure, referred to as restricted downward transitions, can be exploited to speed-up the computation of the stationary probability vector of the chain. To this end we define a new M/G/1-type Markov chain with a smaller block s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009